A Random Walk with Collapsing Bonds and Its Scaling Limit

نویسنده

  • Majid Hosseini
چکیده

In this note we introduce a self-interacting random walk in a dynamic random environment, prove that it is recurrent and find its scaling limit. The environment evolves in time in conjunction with the random walk and is nonmarkovian; however we will show that the walk only remembers the recent past. Various models of self-interacting random walks and random walks in dynamic random environments have been studied recently (see for instance [1, 2, 3, 4, 6, 7] and references therein). Consider a particle performing a continuous-time nearest neighbor symmetric random walk on the integers lattice. We assume that the particle is initially at the origin. The times between successive jumps are independent exponential random variables with rate λ. Anytime the particle jumps over the bond connecting two neighboring lattice sites, there is a probability 0 < p ≤ 1 that the bond connecting the sites breaks. The particle is not able to jump over that bond until that bond is repaired. If at the time the particle attempts to jump, one of the bonds neighboring the particle is broken, the particle jumps over the other bond with probability one. If both bonds neighboring the particle are broken, the particle can’t jump when it attempts to do so. The repair times of bonds are independent exponential random variables with rate μ ∈ (0,∞). Initially, there are no broken bonds.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Repeated bond traversal probabilities for the simple random walk

We consider the average numberBm(t) of bonds traversed exactly m times by a t step simple random walk. We determine Bm(t) explicitly in the scaling limit t → ∞ with m/√t fixed in dimension d = 1 and m/ log t fixed in dimension d = 2. The scaling function is an erfc in d = 1 and an exponential in d = 2. PACS number: 05.40.Fb

متن کامل

Loop-Erased Random Walk and Poisson Kernel on Planar Graphs

Lawler, Schramm and Werner showed that the scaling limit of the loop-erased random walk on Z2 is SLE2. We consider scaling limits of the loop-erasure of random walks on other planar graphs (graphs embedded into C so that edges do not cross one another). We show that if the scaling limit of the random walk is planar Brownian motion, then the scaling limit of its loop-erasure is SLE2. Our main co...

متن کامل

Scaling Limit of Loop Erased Random Walk — a Naive Approach

We give an alternative proof of the existence of the scaling limit of loop-erased random walk which does not use Löwner’s differential equation.

متن کامل

Scaling Limit of Loop-erased Random Walk

The loop-erased random walk (LERW) was first studied in 1980 by Lawler as an attempt to analyze self-avoiding walk (SAW) which provides a model for the growth of a linear polymer in a good solvent. The self-avoiding walk is simply a path on a lattice that does not visit the same site more than once. Proving things about the collection of all such paths is a formidable challenge to rigorous math...

متن کامل

The scaling limit of loop-erased random walk in three dimensions

Loop-erased random walk is a model for a random simple (i.e. non-selfintersecting) path created by taking a random walk and, whenever it hits itself, deleting the resulting loop and continuing. We will explain why this model is interesting and why scaling limits are interesting, and then go on to describe the proof (that the limit exists), as time will permit.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2008